Dynamic Boundary Time Warping for sub-sequence matching with few examples

The paper presents a novel method of finding fragment in long temporal sequence similar to the set shorter sequences. We are first propose an algorithm for such search that does not rely on computing average from query examples. Instead, we use examples as is, utilizing all them simultaneously. introduced based Dynamic Time Warping (DTW) technique is suited explicitly few-shot query-by-example retrieval tasks. evaluate it two different problems field Natural Language Processing. results show either outperforms baselines and previous approaches or achieves comparable when low number available. • Varied Information Retrieval can be treated sub-sequence matching. A new few proposed. It retrieve sequential information untrimmed stream, e.g., text video. Has good computational complexity establishes direction problems.